Termination w.r.t. Q proof of TRS/SK902.60.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

f(g(f(a), h(a, f(a)))) → f(h(g(f(a), a), g(f(a), f(a))))

Q is empty.

↳ QTRS

  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f(g(f(a), h(a, f(a)))) → f(h(g(f(a), a), g(f(a), f(a))))

Q is empty.

We use [23] with the following order to prove termination.

Recursive path order with status [2].
Quasi-Precedence:

[g₂, a] > [f₁, h_2]

Status:

a: multiset
g₂: multiset
f₁: multiset
h₂: [1,2]